Parallel-Sequential Texture Analysis
نویسندگان
چکیده
Color induced texture analysis is explored, using two texture analysis techniques: the co-occurrence matrix and the color correlogram as well as color histograms. Several quantization schemes for six color spaces and the humanbased 11 color quantization scheme have been applied. The VisTex texture database was used as test bed. A new color induced texture analysis approach is introduced: the parallel-sequential approach; i.e., the color correlogram combined with the color histogram. This new approach was found to be highly successful (up to 96% correct classification). Moreover, the 11 color quantization scheme performed excellent (94% correct classification) and should, therefore, be incorporated for real-time image analysis. In general, the results emphasize the importance of the use of color for texture analysis and of color as global image feature. Moreover, it illustrates the complementary character of both features.
منابع مشابه
Scalable Data Parallel Algorithms for Texture Synthesis and Compression using Gibbs Random Fields
This paper introduces scalable data parallel algorithms for image processing. Focusing on Gibbs and Markov Random Field model representation for textures, we present parallel algorithms for texture synthesis, compression, and maximum likelihood parameter estimation, currently implemented on Thinking Machines CM-2 and CM-5. Use of ne-grained, data parallel processing techniques yields real-time ...
متن کاملThe Mask Tuning Scheme for Texture Feature Extraction and Its Parallel Implementation
This paper describes the parallel extension of the mask tuning scheme for texture feature extraction. Unlike other parallel systems in which specific parallel computer architectures are required, our parallel solution to increase processing speed is examined by introducing the concept of remote procedure call(RPC) in distributed systems for Iocal or remote interprocess communication. Based on o...
متن کاملScalable data parallel algorithms for texture synthesis using Gibbs random fields
This article introduces scalable data parallel algorithms for image processing. Focusing on Gibbs and Markov random field model representation for textures, we present parallel algorithms for texture synthesis, compression, and maximum likelihood parameter estimation, currently implemented on Thinking Machines CM-2 and CM-5. The use of fine-grained, data parallel processing techniques yields re...
متن کاملEvolution of texture in an ultrafine and nano grained magnesium alloy
The evolution of texture was discussed during the formation of ultra-fine and nano grains in a magnesium alloy severely deformed through accumulative back extrusion (ABE). The microstructure and texture obtained after applying multiple deformation passes at temperatures of 100 and 250°C were characterized. The results showed that after single ABE pass at 100°C an ultrafine/nano grained microstr...
متن کاملAn efficient parallel texture classification for image retrieval
This paper proposes an efficient parallel approach to texture classification for image retrieval. The idea behind this method is to pre-extract texture features in terms of texture energy measurement associated with a 'tuned' mask and store them in a multiscale and multi-orientation texture class database via a two-dimensional linked list for query. Thus, each texture class sample in the databa...
متن کامل